A metaheuristic for solving large instances of the School Bus Routing Problem
نویسندگان
چکیده
This research is motivated by a real-life school bus routing problem (SBRP). In the Flemish region (Belgium), transport of children to their school is organized by the Flemish transportation company. Each pupil having the right to be transported to its school, also has the right to a bus stop located at a distance less than 750 metres from its residence. To efficiently design the routes, a set of potential stops is determined, so that each pupil has at least one stop he/she can walk to. Routes are then determined for the school buses so that all students are picked up at a stop they are allowed to use, while making sure that the capacity of the buses is not exceeded. Flemish transportation company are faced with problems where up to 3000 students have to be picked up and brought to 7 different schools. The basic SBRP as described in [3] is a generalization of the basic vehicle routing problem (VRP) and therefore also NP-hard. In general, the VRP defines an optimization problem where allocation of stops to vehicles and the optimal sequence of stops with corresponding demands have to be determined without violating vehicle capacities. Different constraints can be envisaged such as maximum distance constraint and time windows. The total distance covered by all vehicles acts as a criterion has to be minimized [4]. In contrast with the basic VRP, total demand for each stop is not known beforehand. We only know whether a student is allowed to walk to a stop or not. This gives us the possibility to incur potential savings (e.g. not have to visit a stop), since we can assign students to stops ourselves. However, introducing these extra assignment decisions makes the problem much more difficult to solve. Figure 1 shows an example of such a SBRP. In this figure, dots represent students, the small squares represent potential stops, the large square
منابع مشابه
Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملارائه یک مدل مسیریابی اتوبوس مدرسه(SBRP) با در نظر گرفتن امکان برونسپاری دانشآموزان
Current studies regarding to school bus routing problem basically are about travel time and cost of travel minimization. In this paper we pay more attention to the challenges of Transportation Company in getting students to their school in a way that maximize the company profit as well as minimize the cost of students assignment. In this study for the first time the transportation company is al...
متن کاملExact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem
As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objecti...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کامل